Generating Bent Sequences
نویسندگان
چکیده
Adams, C. We introduce two general classes of bent sequences, " bent-based " and " linear-based " , and conjecture that all bent sequences fall into these classes. This gives us a framework for discussing the construction and cardinality of the set of bent sequences of any given order.
منابع مشابه
Comments on 'Generating and counting binary Bent sequences'
We prove that the conjecture on bent sequences stated in Generating and counting bent sequences IEEE Transactions on Information Theory IT No by C M Adams and S E Tavares is false Let Vn be the vector space of n tuples of elements from GF Any map from Vn to GF f can be uniquely written as a polynomial in coordinates x xn f x xn M
متن کاملConstructions of Bent Functions from Two Known Bent Functions
A (1,-1)-matrix will be called a bent type matrix if each row and each column are bent sequences. A similar description can be found in Carlisle M. in which the authors use the properties of bent type matrices to construct a class of bent functions. In this paper we give a general method to construct bent type matrices and show that the bent sequence obtained from a bent type matrix is a genera...
متن کاملNew Constructions of p-ary Bent Sequences
In this paper, using bent functions defined on the finite field, we generalized the construction method of the family of p-ary bent sequences with balanced and optimal correlation property introduced by Kumar and Moreno for an odd prime p [3], called a generalized p-ary bent sequence. It turns out that the family of balanced p-ary sequences with optimal correlation property introduced by Moriuc...
متن کاملConstruction of bent functions from two known bent functions
A (I, -1 )-matrix will be called a bent type matrix if each row and each column are bent sequences. A similar description can be found in Carlisle M. Adams and Stafford E. Tavares, Generating and counting binary sequences, IEEE Trans. Inform. Theory, vol. 36, no. 5, pp. 1170-1173, 1990, in which the authors use the properties of bent type matrices to construct a class of bent functions. In this...
متن کاملA Mapping From Length n Binary Linear Block Codes to Length 2 Bipolar Bent and Almost Bent Sequences
It is shown how a half-rate length n binary linear block code can always be used to generate a pair of bipolar Bent sequences of length 2n, for n even. The technique uses the length 2n Walsh-Hadamard Transform in conjunction with multidimensional cyclic shifts and multidimensional phase shifts. The technique is also used to generate Almost Bent sequences when n is odd. Note: This paper remains ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 39 شماره
صفحات -
تاریخ انتشار 1992